New Circular Drawing Algorithms
نویسندگان
چکیده
In the circular (other alternate concepts are outerplanar, convex and one-page) drawing one places vertices of a n−vertex m−edge connected graph G along a circle, and the edges are drawn as straight lines. The smallest possible number of crossings in such a drawing of the graph G is called circular (outerplanar,convex, or one-page) crossing number of the graph G. This paper addresses heuristic algorithms to find an ordering of vertices to minimise the number of crossings in the corresponding circular drawing of the graph. New algorithms to find low crossing circular drawings are presented, and compared with algorithm of Mäkinen [4], CIRCULAR+ algorithm of Six and Tollis [5] and algorithm of Baur and Brandes [1]. We get better or comparable results to the other algorithms.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Closed-form Semi-analytical Elastic-Plastic Solution for Predicting the Onset of Flange Wrinkling in Deep-drawing of a Two-layered Circular Plate
In this paper to predict the critical conditions for onset of elastic-plastic wrinkling of flange of a two-layered circular blank during the deep-drawing process a closed-form semi-analytical elastic-plastic solution using Tresca yield criterion alongwith deformation theory in plasticity with considernig the perfectly plastic behaviour of materials is presented. Simplifying the presented soluti...
متن کاملA framework and algorithms for circular drawings of graphs
In this paper, we present a framework and two linear time algorithms for obtaining circular drawings of graphs. The first technique produces circular drawings of biconnected graphs and finds a zero crossing circular drawing if one exists. The second technique finds multiple embedding circle drawings. Techniques for the reduction of edge crossings are also discussed. Results of experimental stud...
متن کامل